SPARQL Query Generator (SQG)
نویسندگان
چکیده
Abstract This paper describes a program—SPARQL Query Generator (SQG)—which takes as input an OWL ontology, set of object descriptions in terms this ontology and class the context, generates relatively large numbers queries about various types objects expressed RDF/OWL. The intent is to use SQG evaluating data representation retrieval systems from perspective semantics coverage. While there are many benchmarks for assessing efficiency systems, none existing solutions SPARQL query generation focus on coverage semantics. Some not scalable since manual work needed process; some do consider (or totally ignore) ontology/instance or rely real queries/datasets that readily available our domain interest. Our experimental results show performs reasonably well with generating guarantees good axioms included generated queries.
منابع مشابه
Towards a Top-K SPARQL Query Benchmark Generator
The research on optimization of top-k SPARQL query would largely benefit from the establishment of a benchmark that allows comparing different approaches. For such a benchmark to be meaningful, at least two requirements should hold: 1) the benchmark should resemble reality as much as possible, and 2) it should stress the features of the topk SPARQL queries both from a syntactic and performance ...
متن کاملSPARQL-DL: SPARQL Query for OWL-DL
There are many query languages (QLs) that can be used to query RDF and OWL ontologies but neither type is satisfactory for querying OWL-DL ontologies. RDF-based QLs (RDQL, SeRQL, SPARQL) are harder to give a semantics w.r.t. OWL-DL and are more powerful than what OWL-DL reasoners can provide. DL-based QLs (DIG ask queries, nRQL) have clear semantics but are not powerful enough in the general ca...
متن کاملIncremental SPARQL Query Processing
The number of linked data sources available on the Web is growing at a rapid rate. Moreover, users are showing an interest for any framework that allows them to obtain answers, for a formulated query, accessing heterogeneous data sources without the need of explicitly specifying the sources to answer the query. Our proposal focus on that interest and its goal is to build a system capable of ans...
متن کاملPredicting SPARQL Query Performance
We address the problem of predicting SPARQL query performance. We use machine learning techniques to learn SPARQL query performance from previously executed queries. We show how to model SPARQL queries as feature vectors, and use k -nearest neighbors regression and Support Vector Machine with the nu-SVR kernel to accurately (R value of 0.98526) predict SPARQL query execution time. 1 Query Perfo...
متن کاملFlexible query processing for SPARQL
Flexible querying techniques can enhance users’ access to complex, heterogeneous datasets in settingssuch as Linked Data, where the user may not always know how a query should be formulated in order to retrievethe desired answers. This paper presents query processing algorithms for a fragment of SPARQL 1.1 incorporatingregular path queries (property path queries), extended with quer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal on Data Semantics
سال: 2021
ISSN: ['1861-2040', '1861-2032']
DOI: https://doi.org/10.1007/s13740-021-00133-y